-
1 reducible problem
Большой англо-русский и русско-английский словарь > reducible problem
-
2 reducible problem
Математика: сводимая проблема -
3 reducible problem
мат. -
4 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
5 сводимая проблема
Большой англо-русский и русско-английский словарь > сводимая проблема
-
6 set
1) множество; совокупность; семейство; ряд; последовательность2) набор; комплект3) установка5) устанавливать в определённое положение; устанавливать в определённое состояние6) монтировать; налаживать•- set constant- set origin
- set the problem
- add set
- affected set
- alphanumeric character set
- alphameric character set
- ambiguity set
- basis set
- board set
- bounded set
- cataloged data set
- change set
- character set
- chip set
- choice set
- closed set
- code set
- coded character set
- complete set
- concatenated data set
- confidence set
- connected set
- contact set
- countable set
- creative set
- cut set
- data set
- data-structure set
- delete set
- denumerable set
- derived set
- dividing set
- dynamic data set
- empty set
- enumerable set
- equations set
- failure set
- fault set
- feature set
- file set - fuzzy set
- general recursive set
- generation data set
- graphics set
- indexed sequential data set
- indexed set
- infinite set
- instruction set
- integrated tool set
- interface set
- interleaved carbon set
- keyboard send/receive set
- line data set
- microprocessor set
- model set
- N-character set
- N-char set
- nontemporary data set
- null set
- numeric character set
- open set
- order set
- ordered set
- overflow data set
- page data set
- partitioned data set
- photomask set
- power set
- receive/send keyboard set
- recursive set
- recursively enumerable set
- reduced instruction set
- reducible set - set of curves
- shared data set
- simply ordered set
- singular set
- soft instruction set
- software product set
- sorted set
- standard file defenition set
- success set
- telephone data set
- temporary data set
- test set
- training set
- universal set
- user's set
- working set
- zero setEnglish-Russian dictionary of computer science and programming > set
См. также в других словарях:
reducible — [[t]rɪdju͟ːsɪb(ə)l, AM du͟ːs [/t]] ADJ: v link ADJ to n, usu with brd neg If you say that an idea, problem, or situation is not reducible to something simple, you mean that it is complicated and cannot be described in a simple way. [FORMAL] The… … English dictionary
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Transformation problem — In 20th century discussions of Karl Marx s economics the transformation problem is the problem of finding a general rule to transform the values of commodities (based on labour according to his labour theory of value) into the competitive prices… … Wikipedia
Closest pair of points problem — Closest pair of points shown in red The closest pair of points problem or closest pair problem is a problem of computational geometry: given n points in metric space, find a pair of points with the smallest distance between them. Its two… … Wikipedia
Quantum mind–body problem — The quantum mind–body problem refers to the philosophical discussions of the mind–body problem in the context of quantum mechanics. Since quantum mechanics involves quantum superpositions, which are not perceived by observers, some… … Wikipedia
Mind–body problem — René Descartes illustration of mind/body dualism. Inputs are passed on by the sensory organs to the epiphysis in the brain and from there to the immaterial spirit … Wikipedia
NP-complete problem — ▪ computer science any of a class of computational problems for which no efficient solution algorithm has been found. Many significant computer science problems belong to this class e.g., the traveling salesman problem, satisfiability… … Universalium
Morphological analysis (problem-solving) — Morphological Analysis or General Morphological Analysis is a method developed by Fritz Zwicky (1967, 1969) for exploring all the possible solutions to a multi dimensional, non quantified problem complex.[1] Contents 1 Overview 1.1 Morphological… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia